An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures
نویسندگان
چکیده
This paper considers the transmission of an infinite sequence messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at destination subject to fixed decoding delay. While capacity channel that introduces only bursts erasures has been known for more than fifteen years, recently, with either one burst or multiple arbitrary in any fixed-sized sliding window established. However, explicit codes shown achieve this admissible set parameters require large field size scales exponentially Recently, it there exist which quadratically constructions were specific combinations parameters. work describes rate-optimal construction all and delay
منابع مشابه
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixe...
متن کاملRate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures
Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to B. A recent work by Badr et al. extended this result and introduced a sliding-window channel m...
متن کاملAn adaptive rate-control streaming mechanism with optimal buffer utilization
In this paper, an end-to-end real-time adaptive protocol for multimedia transmission is presented. The bandwidth is dynamically allocated according to the network status, and the client buffer occupancy and playback requirement. The transmission rate is determined by the quadratic probing algorithm that can obtain the maximal utilization of the client buffer and minimal occupation of the networ...
متن کاملCodes Correcting Phased Burst Erasures
We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...
متن کاملExplicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
A stochastic code is a pair of encoding and decoding procedures (Enc;Dec) where Enc : f0; 1g f0; 1g ! f0; 1g, and a message m 2 f0; 1g is encoded by Enc(m;S) where S f0; 1g is chosen uniformly by the encoder. The code is (p; L)-list-decodable against a class C of \channel functions" C : f0; 1g ! f0; 1g if for every message m 2 f0; 1g, and every channel C 2 C that induces at most pn errors, appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3121101